Substitution-closed pattern classes

نویسندگان

Mike D. Atkinson

Nikola Ruskuc

Rebecca Smith

چکیده

The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classified by listing them as a set of explicit families.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CRN Elimination and Substitution Bases for Complexity Classes

Function classes closed with respect to substitution and concatenation recursion on notation are defined as the substitution closure of finite function sets. Consequently, the sets of TC, NC and L computable functions are inductively characterized as the substitution closure of a finite function set.

متن کامل

Sorting classes – Extended Abstract

Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...

متن کامل

The strong independence of substitution and homomorphic replication

— The opérations of homomorphic repHcation and substitution are strongly independent forfull semiAFLs in the sense that if ££ is afull semiAFL closed under neither homomorphic repHcation nor substitution, then the closure of ^ under homomorphic repHcation («&,(&)) is incomparable with the closure of <£ under substitution {Jta(<£)). The leastfull AFL containing afull semiAFL ££ and closed under ...

متن کامل

Wreath Products of Permutation Classes

A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X o Y of two permutation classes X and Y is also closed, and we investigate classes Y with the property that, for any finitely based class X, the wreath product X o Y is also finitely based.

متن کامل